全文获取类型
收费全文 | 5052篇 |
免费 | 420篇 |
国内免费 | 327篇 |
专业分类
化学 | 274篇 |
晶体学 | 2篇 |
力学 | 25篇 |
综合类 | 139篇 |
数学 | 5116篇 |
物理学 | 243篇 |
出版年
2024年 | 10篇 |
2023年 | 100篇 |
2022年 | 138篇 |
2021年 | 120篇 |
2020年 | 199篇 |
2019年 | 227篇 |
2018年 | 215篇 |
2017年 | 198篇 |
2016年 | 123篇 |
2015年 | 90篇 |
2014年 | 174篇 |
2013年 | 451篇 |
2012年 | 191篇 |
2011年 | 295篇 |
2010年 | 299篇 |
2009年 | 436篇 |
2008年 | 378篇 |
2007年 | 274篇 |
2006年 | 316篇 |
2005年 | 216篇 |
2004年 | 199篇 |
2003年 | 173篇 |
2002年 | 164篇 |
2001年 | 147篇 |
2000年 | 105篇 |
1999年 | 95篇 |
1998年 | 89篇 |
1997年 | 64篇 |
1996年 | 47篇 |
1995年 | 51篇 |
1994年 | 39篇 |
1993年 | 28篇 |
1992年 | 25篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有5799条查询结果,搜索用时 46 毫秒
71.
A weighted (unweighted) graph is called equiarboreal if the sum of weights (the number) of spanning trees containing a given edge in is independent of the choice of edge. In this paper, we give some resistance characterizations of equiarboreal weighted and unweighted graphs, and obtain the necessary and sufficient conditions for -subdivision graphs, iterated double graphs, line graphs of regular graphs and duals of planar graphs to be equiarboreal. Applying these results, we obtain new infinite families of equiarboreal graphs, including iterated double graphs of 1-walk-regular graphs, line graphs of triangle-free 2-walk-regular graphs, and duals of equiarboreal planar graphs. 相似文献
72.
73.
A graph is symmetric if its automorphism group acts transitively on the set of arcs of the graph. In this paper, we classify hexavalent symmetric graphs of order for each prime . 相似文献
74.
75.
Amal AlAli 《代数通讯》2017,45(11):4667-4678
76.
77.
This paper focuses on the input-to-state stability for a general class of stochastic multi-group models with multi-dispersal. By incorporating graph theory with Lyapunov method as well as stochastic analysis techniques, novel sufficient criteria are derived, which are in the form of Lyapunov-type theorem and coefficient-type criterion, respectively. Moreover, to show the applicability of our findings, we employ coefficient-type criterion to analyze the input-to-state stability for stochastic coupled oscillators. Finally, a numerical example and its simulations are offered to demonstrate the validity and feasibility of the theoretic results. 相似文献
78.
79.
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient computation in parallel. In particular, we consider computations involving the graph Laplacian, which has significant applications, including diffusion mapping and graph partitioning, among others. We prove results regarding the spectral approximation of the Laplacian of the original graph by the Laplacian of the disaggregated graph. In addition, we construct an alternate disaggregation operator whose eigenvalues interlace those of the original Laplacian. Using this alternate operator, we construct a uniform preconditioner for the original graph Laplacian. 相似文献
80.